Stanton Graph Decompositions
نویسندگان
چکیده
Stanton graphs Sk (in honor of professor Ralph G. Stanton) are defined, and a new graph decomposition problem for Stanton graphs is proposed. Such decompositions of λKv for all v’s with minimum λ’s have been obtained for S3.
منابع مشابه
On the Volume of µ-way G-trade
A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the graph $ G $ in each of the decompositions is the volume of the $ G $-trade and denoted by $ s. $ In this paper, we determine all values $ s $ for which there exists a $ mu $-way $ K_{1,m} $-trade of vo...
متن کاملPlane Decompositions as Tools for Approximation
Tree decompositions were developed by Robertson and Seymour [21]. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to exist in the decomposition graph; we call these new decompositions plane decompositions because we require that the decomposition graph be planar. Firs...
متن کامل6 Plane Decompositions as Tools for Approximation
Tree decompositions were developed by Robertson and Seymour [21]. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to exist in the decomposition graph; we call these new decompositions plane decompositions because we require that the decomposition graph be planar. Firs...
متن کاملTreewidth, Pathwidth and Cospan Decompositions
We will revisit the categorical notion of cospan decompositions of graphs and compare it to the well-known notions of path decomposition and tree decomposition from graph theory. More specifically, we will define several types of cospan decompositions with appropriate width measures and show that these width measures coincide with pathwidth and treewidth. Such graph decompositions of small widt...
متن کاملSimplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کامل